翻訳と辞書 Words near each other ・ Sente (software) ・ Sente Technologies ・ Sentebale ・ Sentech ・ Sentech Tower ・ Senteg ・ Sentein ・ Sentek Global ・ Sentelie ・ Sentema ・ Sentenac-d'Oust ・ Sentenac-de-Sérou ・ Sentence ・ Sentence (law) ・ Sentence (linguistics) ・ Sentence (logic) ・ Sentence (music) ・ Sentence arrangement ・ Sentence boundary disambiguation ・ Sentence clause structure ・ Sentence completion tests ・ Sentence diagram ・ Sentence extraction ・ Sentence function ・ Sentence length ・ Sentence of Death ・ Sentence processing ・ Sentence Review Commission ・ Sentence spacing ・ Sentence spacing in digital media Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Sentence (logic) ： ウィキペディア英語版 Sentence (logic) :''This article is a technical mathematical article in the area of predicate logic. For the ordinary English language meaning see Sentence (linguistics), for a less technical introductory article see Statement (logic).'' In mathematical logic, a sentence of a predicate logic is a boolean-valued well-formed formula with no free variables. A sentence can be viewed as expressing a proposition, something that may be true or false. The restriction of having no free variables is needed to make sure that sentences can have concrete, fixed truth values: As the free variables of a (general) formula can range over several values, the truth value of such a formula may vary. Sentences without any logical connectives or quantifiers in them are known as atomic sentences; by analogy to atomic formula. Sentences are then built up out of atomic sentences by applying connectives and quantifiers. A set of sentences is called a theory; thus, individual sentences may be called theorems. To properly evaluate the truth (or falsehood) of a sentence, one must make reference to an interpretation of the theory. For first-order theories, interpretations are commonly called structures. Given a structure or interpretation, a sentence will have a fixed truth value. A theory is satisfiable when all of its sentences are true. The study of algorithms to automatically discover interpretations of theories that render all sentences as being true is known as the satisfiability modulo theories problem. == Example == The following example is in first-order logic. :$\backslash forall\; y\backslash exists\; x\; (x^2=y)$ ''is'' a sentence. This sentence is true in the positive real numbers ℝ+, false in the real numbers ℝ, and true in the complex numbers ℂ. (In plain English, this sentence is interpreted to mean that every member of the structure concerned is the square of a member of that particular structure.) On the other hand, the formula :$\backslash exists\; x(x^2=y)$ is ''not'' a sentence, because of the presence of the free variable ''y''. In the structure of the real numbers, this formula is true if we substitute (arbitrarily) ''y'' = 2, but is false if ''y'' = –2. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Sentence (logic)」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.